The following five macros are the basis for dkom with doubly - linked lists 下面五个宏是带有双向链表的dkom的基础。
A doubly - linked list links its elements both backward and forward in a circular fashion 在一个循环方式中,双链接列表既向前又向后链接他的元素。
The key feature of a doubly - linked list is that you can add or remove elements anywhere in the list 一个双链接列表的关键特征是:你可以添加或者移除在这个列表中任何位置的元素。
The pages in each level of the index , including the data pages in the leaf level , are linked in a doubly - linked list 索引中每个级别的页(包括叶级别的数据页)链接在一个双向链接的列表中。
All internal data structures , such as b - tree indexes or doubly - linked lists , must be correct at the end of the transaction 事务结束时,所有的内部数据结构(如b树索引或双向链表)都必须是正确的。
For example , arrays can support dictionary look - up and form the basis for sophisticated kinds of data structures , such as key - value pairs , linked lists , doubly - linked lists , and trees 例如,数组可以支持字典查询,并为高级类型的数据结构,例如键-值对、链接表、双链表和树形成基础。